math/big.Int.neg (field)
167 uses
math/big (current package)
float.go#L610: z.neg = x.neg
float.go#L1112: z.neg = x.neg
float.go#L1152: z.a.neg = x.neg
int.go#L34: neg bool // sign
int.go#L51: if x.neg {
int.go#L65: z.neg = neg
int.go#L72: z.neg = false
int.go#L91: return &Int{neg: x < 0, abs: abs}
int.go#L98: z.neg = x.neg
int.go#L122: z.neg = false
int.go#L129: z.neg = false
int.go#L136: z.neg = len(z.abs) > 0 && !z.neg // 0 has no sign
int.go#L142: neg := x.neg
int.go#L143: if x.neg == y.neg {
int.go#L157: z.neg = len(z.abs) > 0 && neg // 0 has no sign
int.go#L163: neg := x.neg
int.go#L164: if x.neg != y.neg {
int.go#L178: z.neg = len(z.abs) > 0 && neg // 0 has no sign
int.go#L198: z.neg = false
int.go#L202: z.neg = len(z.abs) > 0 && x.neg != y.neg // 0 has no sign
int.go#L224: z.neg = neg
int.go#L275: z.neg = len(z.abs) > 0 && x.neg != y.neg // 0 has no sign
int.go#L284: z.neg = len(z.abs) > 0 && x.neg // 0 has no sign
int.go#L301: z.neg, r.neg = len(z.abs) > 0 && x.neg != y.neg, len(r.abs) > 0 && x.neg // 0 has no sign
int.go#L309: y_neg := y.neg // z may be an alias for y
int.go#L312: if r.neg {
int.go#L332: if z.neg {
int.go#L333: if y0.neg {
int.go#L362: if m.neg {
int.go#L363: if y0.neg {
int.go#L408: neg := x.neg != y.neg
int.go#L413: r_neg = x.neg
int.go#L415: r_neg = y.neg
int.go#L421: r_neg = !y.neg
int.go#L429: r_neg = x.neg
int.go#L433: r_neg = x.neg
int.go#L438: r_neg = !x.neg
int.go#L448: z.neg = neg && len(z_abs) > 0 // 0 has no sign
int.go#L452: r.neg = r_neg
int.go#L469: case x.neg == y.neg:
int.go#L471: if x.neg {
int.go#L474: case x.neg:
int.go#L514: if x.neg {
int.go#L530: return w >= 0 || x.neg && w == -w
int.go#L537: return !x.neg && len(x.abs) <= 64/_W
int.go#L551: if x.neg {
int.go#L603: z.neg = false
int.go#L661: if y.neg {
int.go#L683: z.neg = len(z.abs) > 0 && x.neg && len(yWords) > 0 && yWords[0]&1 == 1 // 0 has no sign
int.go#L684: if z.neg && len(mWords) > 0 {
int.go#L687: z.neg = false
int.go#L706: lenA, lenB, negA, negB := len(a.abs), len(b.abs), a.neg, b.neg
int.go#L712: z.neg = false
int.go#L718: x.neg = negA
int.go#L726: y.neg = negB
int.go#L813: z.neg = x.neg != neg
int.go#L924: negA := a.neg
int.go#L935: y.neg = !y.neg
int.go#L944: x.neg = !x.neg
int.go#L959: if n.neg || len(n.abs) == 0 {
int.go#L960: z.neg = false
int.go#L964: z.neg = false
int.go#L975: if n.neg {
int.go#L979: if g.neg {
int.go#L993: if x.neg {
int.go#L1022: if b.neg {
int.go#L1023: if a.neg {
int.go#L1026: b.neg = false
int.go#L1164: if x.neg || x.Cmp(p) >= 0 { // ensure 0 <= x < p
int.go#L1184: z.neg = x.neg
int.go#L1190: if x.neg {
int.go#L1195: z.neg = true // z cannot be zero if x is negative
int.go#L1200: z.neg = false
int.go#L1217: if x.neg {
int.go#L1234: if x.neg {
int.go#L1238: z.neg = len(z.abs) > 0
int.go#L1242: z.neg = false
int.go#L1248: if x.neg == y.neg {
int.go#L1249: if x.neg {
int.go#L1254: z.neg = true // z cannot be zero if x and y are negative
int.go#L1260: z.neg = false
int.go#L1265: if x.neg {
int.go#L1272: z.neg = false
int.go#L1278: if x.neg == y.neg {
int.go#L1279: if x.neg {
int.go#L1284: z.neg = false
int.go#L1290: z.neg = false
int.go#L1294: if x.neg {
int.go#L1298: z.neg = true // z cannot be zero if x is negative and y is positive
int.go#L1305: z.neg = false
int.go#L1311: if x.neg == y.neg {
int.go#L1312: if x.neg {
int.go#L1317: z.neg = true // z cannot be zero if x and y are negative
int.go#L1323: z.neg = false
int.go#L1328: if x.neg {
int.go#L1335: z.neg = true // z cannot be zero if one of x or y is negative
int.go#L1341: if x.neg == y.neg {
int.go#L1342: if x.neg {
int.go#L1347: z.neg = false
int.go#L1353: z.neg = false
int.go#L1358: if x.neg {
int.go#L1365: z.neg = true // z cannot be zero if only one of x or y is negative
int.go#L1371: if x.neg {
int.go#L1374: z.neg = false
int.go#L1380: z.neg = true // z cannot be zero if x is positive
int.go#L1387: if x.neg {
int.go#L1390: z.neg = false
intconv.go#L25: return string(x.abs.itoa(x.neg, base))
intconv.go#L34: return append(buf, x.abs.itoa(x.neg, base)...)
intconv.go#L107: case x.neg:
intconv.go#L207: z.neg = len(z.abs) > 0 && neg // 0 has no sign
intmarsh.go#L25: if x.neg {
intmarsh.go#L43: z.neg = b&1 != 0
intmarsh.go#L75: return x.abs.itoa(x.neg, 10), nil
natmul.go#L297: z1.neg = true
prime.go#L39: if x.neg || len(x.abs) == 0 {
rat.go#L63: z.a.neg = f < 0
rat.go#L281: if x.a.neg {
rat.go#L299: if x.a.neg {
rat.go#L308: z.a.neg = a.neg != b.neg
rat.go#L330: z.a.neg = !z.a.neg
rat.go#L372: z.a.neg = false
rat.go#L379: z.a.neg = len(z.a.abs) > 0 && !z.a.neg // 0 has no sign
rat.go#L437: z.a.neg = false
rat.go#L446: neg := z.a.neg
rat.go#L447: z.a.neg = false
rat.go#L448: z.b.neg = false
rat.go#L453: z.a.neg = neg
rat.go#L481: z.neg = x.neg
rat.go#L530: z.a.neg = false
rat.go#L559: z.a.neg = a.neg != b.neg
ratconv.go#L205: z.a.neg = neg && len(z.a.abs) > 0 // 0 has no sign
ratconv.go#L371: if x.a.neg {
ratmarsh.go#L35: if x.a.neg {
ratmarsh.go#L65: z.a.neg = b&1 != 0